We investigate a model of communications protocols based on finite-state machines. The problem addressed is how to ensure certain generally desirable properties, which make protocols "well-formed", i.e., specifying a response to those and only those events that can actually occur. We determine to what extent the problem is solvable, and describe one approach to solving it.
The corresponding journal paper appeared in J. ACM 30(2) (1981) 323-342.
By: Daniel Brand, Pietro Zafiropulo
Published in: RZ1053 in 1981
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .